A Category Theoretic View of Contextual Types: From Simple Types to Dependent Types

نویسندگان

چکیده

We describe the categorical semantics for a simply typed variant and simplified dependently of Cocon , contextual modal type theory where box modality mediates between weak function space that is used to represent higher-order abstract syntax (HOAS) trees strong describes (recursive) computations about them. What makes different from standard theories presence first-class contexts objects are closed with respect given context assumptions. Following M. Hofmann’s work, we use presheaf model characterise HOAS trees. Surprisingly, this already provides necessary structure also . In particular, can capture using comonad ♭ restricts presheaves their elements. This gives simple semantic characterisation invariants types (e.g. substitution invariance) identifies as type-theoretic models. further extend dependent categories families show fragment without recursor in Fitch-style presented by Birkedal et al.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

: examining l2 teachers’ corrective feedback types in relation to learners’ uptake, proficiency levels, and context types

abstract this study investigates the teachers’ correction of students’ spoken errors of linguistic forms in efl classes, aiming at (a) examining the relationship between the learners’ proficiency level and the provision of corrective feedback types, (b) exploring the extent to which teachers’ use of different corrective feedback types is related to the immediate types of context in which err...

Simple Dependent Types: Concord?

We suggest a simple model for a restricted form of dependent types in object oriented languages, whereby classes belong to groups and dependency is introduced via intragroup references using the MyGrp keyword. We introduce motivating and exploratory examples, present the formal model and outline soundness of the type system.

متن کامل

Intersection Types from a Proof-theoretic Perspective

In this work we present a proof-theoretical justification for the intersection type assignment system (IT) by means of the logical system Intersection Synchronous Logic (ISL). ISL builds classes of equivalent deductions of the implicative and conjunctive fragment of the intuitionistic logic (NJ). ISL results from decomposing intuitionistic conjunction into two connectives: a synchronous conjunc...

متن کامل

Gradual Set-Theoretic Types

Problem and motivation. A static type system can be an extremely powerful tool for a programmer, providing early error detection, and offering strong compile-time guarantees on the behavior of a program. However, compared to dynamic typing, static typing often comes at the expense of development speed and flexibility, as statically-typed code might be more difficult to adapt to changing require...

متن کامل

A constraint { based View of Dependent Types ( draft )

In this paper we discuss a constraint{based view of dependent types. We survey several systems that deal with a form of dependent types. We are interested in the use of dependent types for indexed data structures such as arrays and matrices. The main focus is on systems that perform a static program analysis, e.g. consider systems for array{ bounds checking. We review the basic properties of su...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Transactions on Computational Logic

سال: 2022

ISSN: ['1557-945X', '1529-3785']

DOI: https://doi.org/10.1145/3545115